Analysis of SHA-1 in Encryption Mode
نویسندگان
چکیده
This paper analyses the cryptographic hash function SHA1 in encryption mode. A detailed analysis is given of the resistance of SHA-1 against the most powerful known attacks today. It is concluded that none of these attacks can be applied successfully in practice to SHA-1. Breaking SHA-1 in encryption mode requires either an unrealistic amount of computation time and known/chosen texts, or a major breakthrough in cryptanalysis. The original motivation for this analysis is to investigate a block cipher named SHACAL based on these principles. SHACAL has been submitted to the NESSIE call for cryptographic primitives.
منابع مشابه
Related-Key Rectangle Attack of the Full 80-Round HAS-160 Encryption Mode
In this paper we investigate the security of the encryption mode of the HAS-160 hash function. HAS-160 is a Korean hash standard which is widely used in Korea’s industry. The structure of HAS-160 is similar to SHA-1 but includes some improvements. The encryption mode of HAS-160 is defined similarly as the encryption mode of SHA-1 that is called SHACAL-1. In 2006, Dunkelman et. al. [10] successf...
متن کاملRelated-Key Rectangle Attack of the Full HAS-160 Encryption Mode
In this paper we investigate the security of the compression function of HAS-160 in encryption mode. The structure of HAS-160 is similar to SHA-1 besides some modifications.This is the first cryptographic attack that breaks the encryption mode of the full 80-round HAS-160. We apply a key recovery attack that requires 2 chosen plaintexts and 2 80-round HAS-160 encryptions. The attack does not ai...
متن کاملModified Sliding-Mode Control Method for Synchronization a Class of Chaotic Fractional-Order Systems with Application in Encryption
In this study, we propose a secure communication scheme based on the synchronization of two identical fractional-order chaotic systems. The fractional-order derivative is in Caputo sense, and for synchronization, we use a robust sliding-mode control scheme. The designed sliding surface is taken simply due to using special technic for fractional-order systems. Also, unlike most manuscripts, the ...
متن کاملIntroduction to some resistance of hash functions Description of the Biham-Chen attack Cryptanalysis of hash functions in encryption mode Pseudo-collision attack on MD5 Pseudo-collision attack on a SHA-256 variant Observation on SHA-256 Conclusions
Biham and Chen proposed an attack on SHA-0 at Crypt 2004. In this paper, we apply the Biham-Chen attack to analyze SHAlike hash functions regarding pseudo-collision resistance and pseudorandomness. We present a scenario about how to attack SHA-like hash functions applying the Biham and Chen attack. Using this scenario, we present a differential attack on the MD5 hash function and a differential...
متن کاملAnalysis of All-or-Nothing Hash Functions
The most popular method to construct hash functions is to iterate a compression function on the input message. This method is called Merkle-Damgård method. Most hash functions used in practice such as MD4, MD5, SHA-0, SHA-1 are based on this method. However this method is not always the best. For example, this method can not resist multi-collision attack. Recently some modifications of this met...
متن کامل